Resource traces: a domain for processes sharing exclusive resources
نویسندگان
چکیده
منابع مشابه
Resource traces: a domain for processes sharing exclusive resources
The domain of explicitly terminated finite and infinite words is commonly used to define denotational semantics for process algebras such as CSP. In this well-known framework the denotational semantics of concurrency is derived via power-domains from that of non-deterministic choice and interleaving to the effect that the denotational semantics of a concurrent process is equal to the set of all...
متن کاملOptimal Allocation Sequences of Two Processes Sharing a Resource
In this paper, we show that the notion of most regular word in the language formed by all of the words containing a xed number of each letter of an alphabet can be applied to nd the optimal resource allocation policy of the generic system composed by two processes sharing a resource. This system will be modeled as a Petri net. This result can be partially generalized to non periodic allocation ...
متن کاملAllocation sequences of two processes sharing a resource
We study a Petri net model of a system composed of two processes sharing a resource. Conflicts may occur over the usage of the shared resource, thus making the system nondeterministic. Therefore, in the context of minimax algebra, it cannot be formulated as a linear system in order to compute its performance measures. However, if the sequence by which the resource is allocated to the two proces...
متن کاملVirtually Exclusive Resources
Independence preservation, a desirable property in realtime locking protocols that isolates tasks from delays due to unrelated critical sections, is formalized. It is shown that independence preservation is impossible if temporary job migrations are disallowed. The OMIP, a new, asymptotically optimal, independence-preserving locking protocol for clustered scheduling based on migratory priority ...
متن کاملA Synergistic Analysis for Sharing and Groundness with Traces Linearity
Accurate variable sharing information is crucial both in the automatic parallelisation and in the optimisation of sequential logic programs. Analysis for possible variable sharing is thus an important topic in logic programming and many analyses have been proposed for inferring dependencies between the variables of a program, for instance, by combining domains and analyses. This paper develops ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00336-4